Non-volatile spin switch for Boolean and non-Boolean logic
نویسندگان
چکیده
منابع مشابه
Graphene-Based Non-Boolean Logic Circuits
Graphene revealed a number of unique properties beneficial for electronics. However, graphene does not have an energy band-gap, which presents a serious hurdle for its applications in digital logic gates. The efforts to induce a band-gap in graphene via quantum confinement or surface functionalization have not resulted in a breakthrough. Here we show that the negative differential resistance ex...
متن کاملBeyond-CMOS Device Benchmarking for Boolean and Non-Boolean Logic Applications
The latest results of benchmarking research are presented for a variety of beyond-CMOS charge- and spin-based devices. In addition to improving the device-level models, several new device proposals and a few majorly modified devices are investigated. Deep pipelining circuits are employed to boost the throughput of low-power devices. Furthermore, the benchmarking methodology is extended to inter...
متن کاملExploring Boolean and Non-Boolean Computing Applications of Spin Torque Devices
In this paper we discuss the potential of emerging spintorque devices for computing applications. Recent proposals for spinbased computing schemes may be differentiated as ‘all-spin’ vs. hybrid, programmable vs. fixed, and, Boolean vs. non-Boolean. Allspin logic-styles may offer high area-density due to small form-factor of nano-magnetic devices. However, circuit and system-level design techniq...
متن کاملNon-Boolean Authentication
Traditional authentication is two valued. Unfortunately, authentication mechanisms cannot perfectly establish electronic participant’s identity. Despite years of research and its manifestations such as digital signatures, zero knowledge proofs, public key infrastructures, certificates, biometric tools, etc. the best authentication evidence is a combination of multiple factors. All authenticatio...
متن کاملThe Non-approximability of Non-Boolean Predicates
Abstract. Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactive proof systems with harmonic analysis over finite groups, Håstad showed that for sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Physics Letters
سال: 2012
ISSN: 0003-6951,1077-3118
DOI: 10.1063/1.4769989